Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
291	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-21 05:46:08
292	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 Probabilistic complexity theory Structural complexity theory NP-complete problems Approximation algorithms 2-satisfiability L-reduction Reduction PCP theorem Probabilistically checkable proof Theoretical computer science Applied mathematics Computational complexity theory
293	TSP with Bounded Metrics Lars Engebretsen1,? and Marek Karpinski2,?? 1 Department of Numerical Analysis and Computer Science Royal Institute of Technology Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2006-02-09 12:47:04 Complexity classes NP-complete problems Operations research Approximation algorithms Travelling salesman problem Combinatorial optimization APX Optimization problem PCP theorem Theoretical computer science Computational complexity theory Applied mathematics
294	Curriculum Vitae Marek Karpinski Dept. of Computer Science and Hausdorff Center for Mathematics University of Bonn Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-27 06:27:04 Complexity classes Approximation algorithms Marek Karpinski Computational problems APX Combinatorial optimization Polynomial-time approximation scheme NP-complete problems Time complexity Theoretical computer science Computational complexity theory Applied mathematics
295	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-30 06:01:55 Algorithms Linear programming Randomized rounding Probabilistic complexity theory Linear programming relaxation Randomized algorithm Approximation algorithm David Shmoys Theoretical computer science Mathematics Applied mathematics
296	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
297	Ch 7 Approximation algorithms, online algorithms Bertrand Russell[removed]): Although this may seem a paradox, all exact science is dominated by the idea of approximation. 7.1 Minimum spanning tree approximation to the Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-04-08 10:39:43 NP-complete problems Operations research Spanning tree Travelling salesman problem Vertex cover Job shop scheduling Minimum spanning tree Matching Approximation algorithm Theoretical computer science Mathematics Computational complexity theory
298	Approximation Algorithms for Array Partitioning Problems S. Muthukrishnan Torsten Suel Add to Reading List Source URL: cis.poly.edu Language: English - Date: 2003-12-23 13:29:09 NP-complete problems Heuristic function Heuristics Algorithm V-optimal histograms Consensus clustering Mathematics Applied mathematics Theoretical computer science
299	Top-k Aggregation Using Intersections of Ranked Inputs Ravi Kumar Kunal Punera Torsten Suel Add to Reading List Source URL: cis.poly.edu Language: English - Date: 2009-02-28 23:16:02 Operations research Mathematical optimization Search algorithms Theoretical computer science Convex optimization Algorithm Nearest neighbor search Linear programming Approximation algorithm Mathematics Information science Applied mathematics
300	TSP – Infrastructure for the Traveling Salesperson Problem Michael Hahsler Kurt Hornik Add to Reading List Source URL: cran.r-project.org Language: English - Date: 2014-07-02 10:37:25 Travelling salesman problem NP-complete problems Operations research Combinatorial optimization Approximation algorithms Nearest neighbour algorithm Concorde TSP Solver Lin–Kernighan heuristic Heuristic function Theoretical computer science Mathematics Applied mathematics

UPDATE